/// Fibonacci（斐波拉契）递归实现斐波拉切数列
/// 1+1+2+3+5+8+...+(12次)
/// F(0) = 0, F(1)=1; F(n) = F(n-1) +F(n-2)
/// return(F(n))

function rabbit(n) {
    if (n === 0) {
        return(0);
    }
    else if (n === 1) {
        return(1);
    }
    return(rabbit(n-1) + rabbit(n-2))
}
console.log(rabbit(12));
